home *** CD-ROM | disk | FTP | other *** search
- Path: antares.dfma.com!news
- From: johnb@dfma.com (John Breckenridge)
- Newsgroups: comp.lang.c
- Subject: Re: Tough FACTORIAL math problem...
- Date: Fri, 16 Feb 1996 18:13:52 GMT
- Organization: Boothroyd Dewhurst, Inc.
- Message-ID: <4g250f$3ve@antares.dfma.com>
- References: <4fr8be$ass@news.iconn.net> <31224679.6193@born.com> <4fv74c$chq@gatekeeper.alcatel.no> <4fvgbu$kmb@winx03.informatik.uni-wuerzburg.de>
- NNTP-Posting-Host: johnb.dfma.com
- X-Newsreader: Forte Free Agent 1.0.82
-
- schoof@informatik.uni-wuerzburg.de (Jochen Schoof) wrote:
-
- >Storing additional digits is not neccessary. If two numbers of at least
- >two digits have no zeroes in their rightmost digit, the two rightmost
- >digits of their product cannot both be zero and are determined from the
- >two rightmost digits of the two numbers. If you don't believe me feel
- >free to expand the tabular above for these numbers. Unfortunately you'll
- >have to write down 8100 entries... :-)
- This statement is incorrect:
-
- 16 * 25 = 400
-
- >Ans now we should probably keep this away from comp.lang.c and turn to
- >some algorithmic group with it. Does anyone know one..?
-
- John Breckenridge (johnb@dfma.com)
- Boothroyd Dewhurst, Inc.
- All opinions are my own.
- John Breckenridge Boothroyd Dewhurst, Inc.
- johnb@dfma.com all opinions are my own
-
-